The structure of context-free grammatical families
نویسندگان
چکیده
منابع مشابه
Grammatical Framework and Multiple Context-Free Grammars
definitions An abstract definition specifies a computation rule on terms, thereby defining a notion of equality between terms. This equality is a semantic equality, since it does not affect the concrete linearizations; even though two terms are equal by definition, they can be linearized to different strings. Since they do not affect the concrete syntax, we do not mention them further in this a...
متن کاملthe underlying structure of language proficiency and the proficiency level
هدف از انجام این تخقیق بررسی رابطه احتمالی بین سطح مهارت زبان خارجی (foreign language proficiency) و ساختار مهارت زبان خارجی بود. تعداد 314 زبان آموز مونث و مذکر که عمدتا دانشجویان رشته های زبان انگلیسی در سطوح کارشناسی و کارشناسی ارشد بودند در این تحقیق شرکت کردند. از لحاظ سطح مهارت زبان خارجی شرکت کنندگان بسیار با هم متفاوت بودند، (75 نفر سطح پیشرفته، 113 نفر سطح متوسط، 126 سطح مقدماتی). کلا ...
15 صفحه اولImproved genetic algorithm for the context-free grammatical inference
Inductive learning of formal languages, often called grammatical inference, is an active area in machine learning and computational learning theory. By learning a language we understand finding the grammar of the language when some positive (words from language) and negative examples (words that are not in language) are given. Learning mechanisms use the natural language learning model: people ...
متن کاملAbstract Families of Context-Free Grammars
FAMILIES OF CONTEXT-FREE GRAMMARS David Workman Computer Science Department Purdue University West Lafayette, Indiana 47907 March 1974 CSD-TR-1l4
متن کاملRewriting Context-free Families of String Diagrams
String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, which is the standard way of reasoning about the morphisms of monoidal categories, rewriting string diagrams results in shorter equational proofs, because the string diagrammatic representation allows us to formally establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1977
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(77)80030-5